Proof Documents for Automated Origami Theorem Proving
نویسندگان
چکیده
A proof document for origami theorem proving is a record of entire process of reasoning about origami construction and theorem proving. It is produced at the completion of origami theorem proving as a kind of proof certificate. It describes in detail how the whole process of an origami construction and the subsequent theorem proving are carried out in our computational origami system. In particular, it describes logical and algebraic transformations of the prescription of origami construction into mathematical models that in turn become amenable to computation and verification. The structure of the proof document is detailed using an illustrative examples, which reveal the importance of such a document in the analysis of reasoning of origami theorem proving.
منابع مشابه
Computational Origami of a Morley's Triangle
We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process of solving-computing-proving. The whole process is realized by a computational origami system being developed by us. During the computational origami construction, geometric constraints in symbolic and numeric representation are ge...
متن کاملIsar - A Generic Interpretative Approach to Readable Formal Proof Documents
We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interactive theorem proving systems that there is no appropriate notion of proof available that is suitable for human communication, or even just maintenance. Isar’s main aspect is its formal language for natural deduction proofs, whic...
متن کاملInteractive Construction and Automated Proof in Eos System with Application to Knot Fold of Regular Polygons
In origami geometry, the construction and the verification should go hand in hand. When we present a new origami by a new fold method, we will show certain geometric properties that enable us to claim its novelty by formal argument, i.e. proving. It is desirable to have some kind of automation by a computer towards computer-aided origami. Several systems have been implemented to simulate and tr...
متن کاملComputational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of origami geometry. An origami is constructed by a finite sequence of fold steps, each consisting in folding along a fold line or unfolding. We base the fold methods on a formal system called Huzita’s axiom system, and show how folding an origami can be formulated by a conditional rewrite system. A rewriting sequence of origami structures is...
متن کاملProving and Constraint Solving in Computational Origami
Origami (paper folding) has a long tradition in Japan’s culture and education. We are developing a computational origami system, based on symbolic computation system Mathematica, for performing and reasoning about origami on the computer. This system is based on the implementation of the six fundamental origami folding steps (origami axioms) formulated by Huzita. In this paper, we show how our ...
متن کامل